Representative Explanations for Over-Constrained Problems

نویسندگان

  • Barry O'Sullivan
  • Alexandre Papadopoulos
  • Boi Faltings
  • Pearl Pu
چکیده

In many interactive decision making scenarios there is often no solution that satisfies all of the user’s preferences. The decision process can be helped by providing explanations. Relaxations show sets of consistent preferences and, thus, indicate which preferences can be enforced, while exclusion sets show which preferences can be relaxed to obtain a solution. We propose a new approach to explanation based on the notion of a representative set of explanations. The size of the set of explanations we compute is exponentially more compact than that found using common approaches from the literature based on finding all minimal conflicts.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Computing Minimal Correction Subsets

A set of constraints that cannot be simultaneously satisfied is over-constrained. Minimal relaxations and minimal explanations for over-constrained problems find many practical uses. For Boolean formulas, minimal relaxations of over-constrained problems are referred to as Minimal Correction Subsets (MCSes). MCSes find many applications, including the enumeration of MUSes. Existing approaches fo...

متن کامل

QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems

Over-constrained problems can have an exponential number of conflicts, which explain the failure, and an exponential number of relaxations, which restore the consistency. A user of an interactive application, however, desires explanations and relaxations containing the most important constraints. To address this need, we define preferred explanations and relaxations based on user preferences be...

متن کامل

CONSTRAINED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL SOLUTION OF LARGE SCALE RESERVOIR OPERATION PROBLEM

A constrained version of the Big Bang-Big Crunch algorithm for the efficient solution of the optimal reservoir operation problems is proposed in this paper. Big Bang-Big Crunch (BB-BC) algorithm is a new meta-heuristic population-based algorithm that relies on one of the theories of the evolution of universe namely, the Big Bang and Big Crunch theory. An improved formulation of the algorithm na...

متن کامل

Continuous Dynamic Constrained Optimization - The Challenges

A large number of real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well. However, in academic research there are very few studies on continuous dynamic constrained optimisation. In particular, there is no research on answering the question of whether current numerical algorithms ...

متن کامل

Continuous Dynamic Constrained Optimisation - The Challenges

A large number of real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well. However, in academic research there are very few studies on continuous dynamic constrained optimisation. In particular, there is no research on answering the question of whether current numerical algorithms ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007